A Sharp Bound for the Product of Weights of Cross-Intersecting Families

نویسنده

  • Peter Borg
چکیده

Two families A and B of sets are said to be cross-intersecting if each set in A intersects each set in B. For any two integers n and k with 1 6 k 6 n, let ([n] 6k ) denote the family of subsets of {1, . . . , n} of size at most k, and let Sn,k denote the family of sets in ([n] 6k ) that contain 1. The author recently showed that if A ⊆ ( [m] 6r ) , B ⊆ ( [n] 6s ) , and A and B are cross-intersecting, then |A||B| 6 |Sm,r||Sn,s|. We prove a version of this result for the more general setting of weighted sets. We show that if g : ( [m] 6r ) → R+ and h : ( [n] 6s ) → R+ are functions that obey certain conditions, A ⊆ ( [m] 6r ) , B ⊆ ( [n] 6s ) , and A and B are cross-intersecting, then ∑

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs

In $1994,$ degree distance  of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of  multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the  multiplicative version of degree distance and multiplicative ver...

متن کامل

Cross-Intersecting Families of Partial Permutations

For positive integers r and n with r ≤ n, let Pn,r be the family of all sets {(x1, y1), ..., (xr, yr)} such that x1, ..., xr are distinct elements of [n] := {1, ..., n} and y1, ..., yr are also distinct elements of [n]. Pn,n describes permutations of [n]. For r < n, Pn,r describes r-partial permutations of [n]. Families A1, ...,Ak of sets are said to be cross-intersecting if, for any distinct i...

متن کامل

Multiple cross-intersecting families of signed sets

A k-signed r-set on [n] = {1, ..., n} is an ordered pair (A, f), where A is an rsubset of [n] and f is a function from A to [k]. Families A1, ...,Ap are said to be cross-intersecting if any set in any family Ai intersects any set in any other family Aj . Hilton proved a sharp bound for the sum of sizes of cross-intersecting families of r-subsets of [n]. Our aim is to generalise Hilton's bound t...

متن کامل

Towards extending the Ahlswede-Khachatrian theorem to cross t-intersecting families

Ahlswede and Khachatrian's diametric theorem is a weighted version of their complete intersection theorem, which is itself a well known extension of the t-intersecting Erd˝ os-Ko-Rado theorem. The complete intersection theorem says that the maximum size of a family of subsets of [n] = {1,. .. , n}, every pair of which intersects in at least t elements, is the size of certain trivially intersect...

متن کامل

On Families of Weakly Cross-intersecting Set-pairs

Let F be a family of pairs of sets. We call it an (a, b)-set system if for every set-pair (A,B) in F we have that |A| = a, |B| = b, A ∩ B = ∅. The following classical result on families of cross-intersecting set-pairs is due to Bollobás [6]. Let F be an (a, b)-set system with the cross-intersecting property, i.e., for (Ai, Bi), (Aj, Bj) ∈ F with i 6= j we have that both Ai ∩ Bj and Aj ∩ Bi are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2016